Minimization of a convex linear-fractional separable function subject to a convex inequality constraint or linear inequality constraint and bounds on the variables
نویسندگان
چکیده
منابع مشابه
Minimization of a Convex Linear-Fractional Separable Function Subject to a Convex Inequality Constraint or Linear Inequality Constraint and Bounds on the Variables
We consider the problem of minimizing a convex linear-fractional separable function over a feasible region defined by a convex inequality constraint or linear inequality constraint, and bounds on the variables (box constraints). These problems are interesting from both theoretical and practical points of view because they arise in somemathematical programming problems and in various practical p...
متن کاملMinimization of a strictly convex separable function subject to a convex inequality constraint or linear equality constraints and bounds on the variables
In this paper, we consider the problem of minimizing a strictly convex separable function over a feasible region defined by a convex inequality constraint and two-sided bounds on the variables (box constraints). Also, the convex separable program with a strictly convex objective function subject to linear equality constraints and bounded variables is considered. These problems are interesting f...
متن کاملAn efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint
We consider the problem of minimizing a convex separable logarithmic function over a region defined by a convex inequality constraint or linear equality constraint, and twosided bounds on the variables (box constraints). Such problems are interesting from both theoretical and practical point of view because they arise in somemathematical programming problems as well as in various practical prob...
متن کاملConvex separable minimization problems with a linear constraint and bounded variables
Consider the minimization problem with a convex separable objective function over a feasible region defined by linear equality constraint(s)/linear inequality constraint of the form “greater than or equal to” and bounds on the variables. A necessary and sufficient condition and a sufficient condition are proved for a feasible solution to be an optimal solution to these two problems, respectivel...
متن کاملConvex Quadratic Minimization Subject to a Linear Constraint and Box Constraints
where mj > 0, dj > 0, j ∈ J, x = (xj)j∈J, and J def = {1, . . . , n}. Denote this problem by (Q≤) in the first case (problem (1.1)–(1.3) with inequality “≤” constraint (1.2)), by (Q) in the second case (problem (1.1)–(1.3) with equality constraint (1.2)), and by (Q≥) in the third case (problem (1.1)–(1.3) with inequality “≥” constraint (1.2)). Denote by X≤, X, X≥ the feasible set (1.2)–(1.3) in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Research eXpress
سال: 2006
ISSN: 1687-1200,1687-1197
DOI: 10.1155/amrx/2006/36581